not+well
1Well — Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la; originally… …
2Well enough — Well Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la;… …
3Well off — Well Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la;… …
4Well to do — Well Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la;… …
5Well to live — Well Well, adv. [Compar. and superl. wanting, the deficiency being supplied by better and best, from another root.] [OE. wel, AS. wel; akin to OS., OFries., & D. wel, G. wohl, OHG. wola, wela, Icel. & Dan. vel, Sw. v[ a]l, Goth. wa[ i]la;… …
6Well-order — In mathematics, a well order relation (or well ordering) on a set S is a total order on S with the property that every non empty subset of S has a least element in this ordering.Equivalently, a well ordering is a well founded total order.The set… …
7Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… …
8Well-defined — In mathematics, the term well defined is used to specify that a certain concept or object (a function, a property, a relation, etc.) is defined in a mathematical or logical way using a set of base axioms in an entirely unambiguous way and… …
9Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… …
10Well-formed element — In web page design, and generally for all markup languages such as SGML, HTML, and XML, a well formed element is one that is either *opened and subsequently closed, *an empty element, which in that case must be terminated, *properly nested so… …
